Rounding in pairwise average candidate calculations

ABSTRACT

Devices, systems, and methods for unified rounding in sub-block based prediction are described. In a representative aspect, a method of video processing includes generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates, and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video. In another representative aspect, a method of video processing includes generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a ListO motion vector, and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 17/525,745, filed on Nov. 12, 2021, which is a continuation of U.S. patent application Ser. No. 17/161,391, filed on Jan. 28, 2021, which is a continuation of International Patent Application No. PCT/CN2019/117119, filed on Nov. 11, 2019, which claims the priority to and benefits of International Patent Application No. PCT/CN2018/114931, filed on Nov. 10, 2018. All the aforementioned patent applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

The present disclosure is directed generally to image and video coding technologies.

BACKGROUND

Motion compensation is a technique in video processing to predict a frame in a video, given the previous and/or future frames by accounting for motion of the camera and/or objects in the video. Motion compensation can be used in the encoding and decoding of video data for video compression.

SUMMARY

Devices, systems, and methods related to unified rounding methods for sub-block based prediction for image and video coding are described.

In one representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=Shift(MV0x+MV1x,1) and MV*y=Shift(MV0y+MV1y,1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation.

In another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV^(*)x = SignShift(MV0x + MV1x, 1)and MV^(*)y = SignShift(MV0y + MV1y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right) \gg s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a snitt operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV^(*)x = SignShift(MV0x + MV1x, 1)and MV^(*)y = SignShift(MV0y + MV1y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {\left( {x + {off} + 1} \right) \gg s} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=Shift(MV0x+MV1x,1) and MV*y=Shift(MV0y+MV1y,1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the Dairwise merge candidate such that:

MV^(*)x = SignShift(MV0x + MV1x, 1)and MV^(*)y = SignShift(MV0y + MV1y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right) \gg s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV^(*)x = SignShift(MV0x + MV1x, 1)and MV^(*)y = SignShift(MV0y + MV1y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {\left( {x + {off} + 1} \right) \gg s} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=(Shift(MV0x+MV1x,(W+1)))<<W and

MV*y=(Shift(MV0y+MV1y,(W+1)))<<W,

wherein Shift(x, s)=(x+off)>>s, wherein W, off and s are integers, and wherein >> represents a right shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV^(*)x = (SignShift(MV0x + MV1x, (W + 1))) ≪ Wand MV^(*)y = (SignShift(MV0y + MV1y, (W + 1))) ≪ W, wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right) \gg s} \right)} & {x < 0} \end{matrix},} \right.$

wherein W, off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV^(*)x = (SignShift(MV0x + MV1x, (W + 1))) ≪ Wand MV^(*)y = (SignShift(MV0y + MV1y, (W + 1))) ≪ W, wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {\left( {x + {off} + 1} \right) \gg s} & {x < 0} \end{matrix},} \right.$

wherein W, off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a List0 motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the List0 motion vector is MV0=(MV0 x, MV0 y), and

wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

MV*x=Shift(MV0x+MV1′x,1) andMV*y=Shift(MV0y+MV1′y,1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a List0 motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the List0 motion vector is MV0=(MV0 x, MV0 y), and wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

MV^(*)x = (SignShift(MV0x + MV1^(′)x, 1)and MV^(*)y = (SignShift(MV0y + MV1^(′)y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {- \left( {\left( {{- x} + {off}} \right) \gg s} \right)} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the disclosed technology may be used to provide a method of video processing.

This method includes generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a ListO motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the ListO motion vector is MV0=(MV0 x, MV0 y), and wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

MV^(*)x = (SignShift(MV0x + MV1^(′)x, 1)and MV^(*)y = (SignShift(MV0y + MV1^(′)y, 1), wherein ${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {\left( {x + {off}} \right) \gg s} & {x \geq 0} \\ {\left( {x + {off} + 1} \right) \gg s} & {x < 0} \end{matrix},} \right.$

wherein off and s are integers, and wherein >> represents a shift operation.

In yet another representative aspect, the above-described method is embodied in the form of processor-executable code and stored in a computer-readable program medium.

In yet another representative aspect, a device that is configured or operable to perform the above-described method is disclosed. The device may include a processor that is programmed to implement this method.

In yet another representative aspect, a video decoder apparatus may implement a method as described herein.

The above and other aspects and features of the disclosed technology are described in greater detail in the drawings, the description, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows an example of sub-block based prediction.

FIG. 2 shows an example of a simplified affine motion model.

FIG. 3 shows an example of an affine motion vector field (MVF) per sub-block.

FIG. 4 shows an example of motion vector prediction (MVP) for the AF_INTER affine motion mode.

FIGS. 5A and 5B show example candidates for the AF_MERGE affine motion mode.

FIG. 6 shows an example of motion prediction using the alternative temporal motion vector prediction (ATMVP) algorithm for a coding unit (CU).

FIG. 7 shows an example of a CU with sub-blocks and neighboring blocks used by the spatial-temporal motion vector prediction (STMVP) algorithm.

FIG. 8 shows an example of an optical flow trajectory used by the bi-directional optical flow (BIO) algorithm.

FIGS. 9A and 9B show example snapshots of using of the bi-directional optical flow (BIO) algorithm without block extensions.

FIG. 10 shows an example of bilateral matching in the frame-rate up conversion (FRUC) algorithm.

FIG. 11 shows an example of template matching in the FRUC algorithm.

FIG. 12 shows an example of unilateral motion estimation in the FRUC algorithm.

FIG. 13 shows an example of sub-blocks for different components with the 4:2:0 format in Joint Exploration Model (JEM).

FIG. 14 shows an example of sub-blocks for different components with the 4:2:0 format in accordance with the disclosed technology.

FIG. 15 shows another example of sub-blocks for different components with the 4:2:0 format in accordance with the disclosed technology.

FIG. 16 shows an example of sub-block motion vector (MV) copying in accordance with the disclosed technology.

FIG. 17 shows another example of sub-block MV copying in accordance with the disclosed technology.

FIG. 18 shows an example of sub-block MV derivation.

FIGS. 19A-19C show flowcharts of example methods of video processing.

FIG. 20 is a block diagram of an example of a hardware platform for implementing a visual media decoding or a visual media encoding technique described in the present disclosure.

FIG. 21 is a block diagram of an example video processing system in which disclosed techniques may be implemented.

DETAILED DESCRIPTION

Due to the increasing demand of higher resolution video, video coding methods and techniques are ubiquitous in modern technology. Video codecs typically include an electronic circuit or software that compresses or decompresses digital video, and are continually being improved to provide higher coding efficiency. A video codec converts uncompressed video to a compressed format or vice versa. There are complex relationships between the video quality, the amount of data used to represent the video (determined by the bit rate), the complexity of the encoding and decoding algorithms, sensitivity to data losses and errors, ease of editing, random access, and end-to-end delay (latency). The compressed format usually conforms to a standard video compression specification, e.g., the High Efficiency Video Coding (HEVC) standard (also known as H.265 or MPEG-H Part 2), the Versatile Video Coding (VVC) standard to be finalized, or other current and/or future video coding standards.

Sub-block based prediction is first introduced into the video coding standard by the HEVC standard. With sub-block based prediction, a block, such as a Coding Unit (CU) or a Prediction Unit (PU), is divided into several non-overlapped sub-blocks. Different sub-blocks may be assigned different motion information, such as reference index or motion vector (MV), and motion compensation (MC) is performed individually for each sub-block. FIG. 1 shows an example of sub-block based prediction.

Embodiments of the disclosed technology may be applied to existing video coding standards (e.g., HEVC, H.265) and future standards to improve runtime performance. Section headings are used in the present disclosure to improve readability of the description and do not in any way limit the discussion or the embodiments (and/or implementations) to the respective sections only.

1 Examples of the Joint Exploration Model (JEM)

In some embodiments, future video coding technologies are explored using a reference software known as the Joint Exploration Model (JEM). In JEM, sub-block based prediction is adopted in several coding tools, such as affine prediction, alternative temporal motion vector prediction (ATMVP), spatial-temporal motion vector prediction (STMVP), bi-directional optical flow (BIO), Frame-Rate Up Conversion (FRUC), Locally Adaptive Motion Vector Resolution (LAMVR), Overlapped Block Motion Compensation (OBMC), Local Illumination Compensation (LIC), and Decoder-side Motion Vector Refinement (DMVR).

1.1 Examples of Affine Prediction

In HEVC, only a translation motion model is applied for motion compensation prediction (MCP). However, the camera and objects may have many kinds of motion, e.g. zoom in/out, rotation, perspective motions, and/or other irregular motions. JEM, on the other hand, applies a simplified affine transform motion compensation prediction. FIG. 2 shows an example of an affine motion field of a block 200 described by two control point motion vectors V₀ and V₁. The motion vector field (MVF) of the block 200 can be described by the following eauation:

$\begin{matrix} {\{\begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}} \end{matrix}} & {{Eq}.(1)} \end{matrix}$

As shown in FIG. 2 , (v_(0x), v_(0y)) is motion vector of the top-left corner control point, and (v_(1x), v_(1y)) is motion vector of the top-right corner control point. To simplify the motion compensation prediction, sub-block based affine transform prediction can be applied. The sub-block size M×N is derived as follows:

$\begin{matrix} \left\{ \begin{matrix} {M = {{clip}\ 3\left( {4,w,\frac{w \times {MvPre}}{\max\left( {{{abs}\left( {v_{1x} - v_{0x}} \right)},{{abs}\left( {v_{1y} - v_{0y}} \right)}} \right)}} \right)}} \\ {N = {{clip3}\left( {4,h,\frac{h \times {MvPre}}{\max\left( {{{abs}\left( {v_{2x} - v_{0x}} \right)},{{abs}\left( {v_{2y} - v_{0y}} \right)}} \right)}} \right)}} \end{matrix} \right. & {{Eq}.(2)} \end{matrix}$

Here, MvPre is the motion vector fraction accuracy (e.g., 1/16 in JEM). (v_(2x), v_(2y)) is motion vector of the bottom-left control point, calculated according to Eq. (1). M and N can be adjusted downward if necessary to make it a divisor of w and h, respectively.

FIG. 3 shows an example of affine MVF per sub-block for a block 300. To derive motion vector of each MxN sub-block, the motion vector of the center sample of each sub-block can be calculated according to Eq. (1) and rounded to the motion vector fraction accuracy (e.g., 1/16 in JEM). Then the motion compensation interpolation filters can be applied to generate the prediction of each sub-block with derived motion vector. After the MCP, the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.

In the JEM, there are two affine motion modes: AF_INTER mode and AF_MERGE mode. For CUs with both width and height larger than 8, AF_INTER mode can be applied. An affine flag in CU level is signaled in the bitstream to indicate whether AF_INTER mode is used. In the AF_INTER mode, a candidate list with motion vector pair {(v₀, v₁)|v₀,V₀={v_(A), v_(B), v_(c)}, v₁={v_(D),v_(E)}} is constructed using the neighboring blocks.

FIG. 4 shows an example of motion vector prediction (MVP) for a block 400 in the AF_INTER mode. As shown in FIG. 4 , vo is selected from the motion vectors of the sub-block A, B, or C. The motion vectors from the neighboring blocks can be scaled according to the reference list. The motion vectors can also be scaled according to the relationship among the Picture Order Count (POC) of the reference for the neighboring block, the POC of the reference for the current CU, and the POC of the current CU. The approach to select vi from the neighboring sub-block D and E is similar. If the number of candidate list is smaller than 2, the list is padded by the motion vector pair composed by duplicating each of the AMVP candidates. When the candidate list is larger than 2, the candidates can be firstly sorted according to the neighboring motion vectors (e.g., based on the similarity of the two motion vectors in a pair candidate). In some implementations, the first two candidates are kept. In some embodiments, a Rate Distortion (RD) cost check is used to determine which motion vector pair candidate is selected as the control point motion vector prediction (CPMVP) of the current CU. An index indicating the position of the CPMVP in the candidate list can be signaled in the bitstream. After the CPMVP of the current affine CU is determined, affine motion estimation is applied and the control point motion vector (CPMV) is found. Then the difference of the CPMV and the CPMVP is signaled in the bitstream.

When a CU is applied in AF_MERGE mode, it gets the first block coded with an affine mode from the valid neighboring reconstructed blocks. FIG. 5A shows an example of the selection order of candidate blocks for a current CU 500. As shown in FIG. 5A, the selection order can be from left (501), above (502), above right (503), left bottom (504) to above left (505) of the current CU 500. FIG. 5B shows another example of candidate blocks for a current CU 500 in the AF_MERGE mode. If the neighboring left bottom block 501 is coded in affine mode, as shown in FIG. 5B, the motion vectors v₂, v₃ and v₄ of the top left corner, above right corner, and left bottom corner of the CU containing the sub-block 501 are derived. The motion vector v₀ of the top left corner on the current CU 500 is calculated based on v₂, v₃ and v₄. The motion vector v1 of the above right of the current CU can be calculated accordingly.

After the CPMV of the current CU v0 and v1 are computed according to the affine motion model in Eq. (1), the MVF of the current CU can be generated. In order to identify whether the current CU is coded with AF_MERGE mode, an affine flag can be signaled in the bitstream when there is at least one neighboring block is coded in affine mode.

In JEM, the non-merge affine mode can be used only when the width and the height of the current block are both larger than 8; the merge affine mode can be used only when the area (i.e. width×height) of the current block is not smaller than 64.

1.2 Examples of Alternative Temporal Motion Vector Prediction (ATMVP)

In the ATMVP method, the temporal motion vector prediction (TMVP) method is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks smaller than the current CU.

FIG. 6 shows an example of ATMVP motion prediction process for a CU 600. The ATMVP method predicts the motion vectors of the sub-CUs 601 within a CU 600 in two steps. The first step is to identify the corresponding block 651 in a reference picture 650 with a temporal vector. The reference picture 650 is also referred to as the motion source picture. The second step is to split the current CU 600 into sub-CUs 601 and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU.

In the first step, a reference picture 650 and the corresponding block is determined by the motion information of the spatial neighboring blocks of the current CU 600. To avoid the repetitive scanning process of neighboring blocks, the first merge candidate in the merge candidate list of the current CU 600 is used. The first available motion vector as well as its associated reference index are set to be the temporal vector and the index to the motion source picture. This way, the corresponding block may be more accurately identified, compared with TMVP, wherein the corresponding block (sometimes called collocated block) is always in a bottom-right or center position relative to the current CU.

In the second step, a corresponding block of the sub-CU 651 is identified by the temporal vector in the motion source picture 650, by adding to the coordinate of the current CU the temporal vector. For each sub-CU, the motion information of its corresponding block (e.g., the smallest motion grid that covers the center sample) is used to derive the motion information for the sub-CU. After the motion information of a corresponding NxN block is identified, it is converted to the motion vectors and reference indices of the current sub-CU, in the same way as TMVP of HEVC, wherein motion scaling and other procedures apply. For example, the decoder checks whether the low-delay condition (e.g. the POCs of all reference pictures of the current picture are smaller than the POC of the current picture) is fulfilled and possibly uses motion vector MVx (e.g., the motion vector corresponding to reference picture list X) to predict motion vector MVy (e.g., with X being equal to 0 or 1 and Y being equal to 1-X) for each sub-CU.

1.3 Examples of Spatial-Temporal Motion Vector Prediction (STMVP)

In the STMVP method, the motion vectors of the sub-CUs are derived recursively, following raster scan order. FIG. 7 shows an example of one CU with four sub-blocks and neighboring blocks. Consider an 8×8 CU 700 that includes four 4×4 sub-CUs A (701), B (702), C (703), and D (704). The neighboring 4×4 blocks in the current frame are labelled as a (711), b (712), c (713), and d (714).

The motion derivation for sub-CU A starts by identifying its two spatial neighbors. The first neighbor is the NxN block above sub-CU A 701 (block c 713). If this block c (713) is not available or is intra coded the other NxN blocks above sub-CU A (701) are checked (from left to right, starting at block c 713). The second neighbor is a block to the left of the sub-CU A 701 (block b 712). If block b (712) is not available or is intra coded other blocks to the left of sub-CU A 701 are checked (from top to bottom, staring at block b 712). The motion information obtained from the neighboring blocks for each list is scaled to the first reference frame for a given list. Next, temporal motion vector predictor (TMVP) of sub-block A 701 is derived by following the same procedure of TMVP derivation as specified in HEVC. The motion information of the collocated block at block D 704 is fetched and scaled accordingly. Finally, after retrieving and scaling the motion information, all available motion vectors are averaged separately for each reference list. The averaged motion vector is assigned as the motion vector of the current sub-CU.

1.4 Examples of Bi-Directional Optical Flow (BIO)

The bi-directional optical flow (BIO) method is a sample-wise motion refinement performed on top of block-wise motion compensation for bi-prediction. In some implementations, the sample-level motion refinement does not use signaling.

Let I_((k)) be the luma value from reference k (k=0, 1) after block motion compensation, and ∂I^((k))/∂x, ∂I^((k))/∂y are horizontal and vertical components of the I^((k)) gradient, respectively. Assuming the optical flow is valid, the motion vector field (v_(x), v_(y)) is given by:

∂I^((k))/∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0.   Eq. (3)

Combining this optical flow equation with Hermite interpolation for the motion trajectory of each sample results in a unique third-order polynomial that matches both the function values I^((k)) and ∂I^((k))/∂x, ∂I^((k))/∂y derivatives at the ends. The value of this polynomial at t=0 is the BIO prediction:

pred _(BIO)=½·(I ⁽⁰⁾ +I ⁽¹⁾ +v _(x)/2·(τ₁ ∂I ⁽¹⁾ /∂x−τ₀ ∂I ⁽⁰⁾ /∂x)+v_(y)/2·(τ₁ ∂I ⁽¹⁾ /∂y−τ₀ ∂I ⁽⁰⁾ /∂y)).   Eq. (4)

FIG. 8 shows an example optical flow trajectory in the Bi-directional Optical flow (BIO) method. Here, τ₀ and τ₁ denote the distances to the reference frames. Distances τ₀ and τ₁ are calculated based on POC for Ref₀ and Ref₁: τ₀=POC(current)−POC(Ref₀), τ₁=POC(Ref₁)−POC(current). If both predictions come from the same time direction (either both from the past or both from the future) then the signs are different (e.g., τ₀·τ₁<0). In this case, BIO is applied if the prediction is not from the same time moment (e.g., τ₀≠τ₁). Both referenced regions have non-zero motion (e.g., MVx₀, MVy₀, MVx₁, MVy₁≠0) and the block motion vectors are proportional to the time distance (e.g., MVx₀/MVx₁=MVy₀/MVy₁=−τ₀/τ₁).

The motion vector field (v_(x), v_(y)) is determined by minimizing the difference Δ between values in points A and B. FIGS. 9A-9B show an example of intersection of motion trajectory and reference frame planes. Model uses only first linear term of a local Taylor expansion for Δ:

Δ=I⁽⁰⁾ −I ⁽¹⁾ ₀ +v _(x)(τ₁ ∂I ⁽¹⁾ /∂x+τ ₀ ∂I ⁽⁰⁾ /∂x)+v_(y)(τ₁ ∂I ⁽¹⁾ /∂y+τ ₀ ∂I ⁽⁰⁾ /∂y))   Eq. (5)

All values in the above equation depend on the sample location, denoted as (i′, j′) . Assuming the motion is consistent in the local surrounding area, A can be minimized inside the (2M+1)×(2M+1) square window SI centered on the currently predicted point (i,j), where M is equal to 2:

$\begin{matrix} {\left( {v_{x},v_{y}} \right) = {\underset{v_{x},v_{y}}{\arg\min}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\Delta^{2}\left\lbrack {i^{\prime},j^{\prime}} \right\rbrack}}}} & {{Eq}.(6)} \end{matrix}$

For this optimization problem, the JEM uses a simplified approach making first a minimization in the vertical direction and then in the horizontal direction. This results in the following:

$\begin{matrix} {v_{x} = {{\left( {s_{1} + r} \right) > {{m?{clip}}3\left( {{- {thBIO}},{thBIO},{- \frac{s_{3}}{\left( {s_{1} + r} \right)}}} \right)}}:0}} & {{Eq}.(7)} \end{matrix}$ $\begin{matrix} {v_{y} = {{\left( {s_{5} + r} \right) > {{m?{clip}}3\left( {{- {thBIO}},{thBIO},{- \frac{s_{6} - {v_{x}s_{2}/2}}{\left( {s_{5} + r} \right)}}} \right)}}:0}} & {{Eq}.(8)} \end{matrix}$ where, $\begin{matrix} {{s_{1} = {\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)^{2}}};} & {{Eq}.(9)} \end{matrix}$ ${s_{3} = {\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {I^{(1)} - I^{(0)}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)}}};$ ${s_{2} = {\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)}}};$ ${s_{5} = {\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)^{2}}};$ $s_{6} = {\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {I^{(1)} - I^{(0)}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)}}$

In order to avoid division by zero or a very small value, regularization parameters r and m can be introduced in Eq. (7) and Eq. (8), where:

r=500·4^(d−8)   Eq. (10)

m=700·4^(d−8)   Eq. (11)

Here, d is bit depth of the video samples.

In order to keep the memory access for BIO the same as for regular bi-predictive motion compensation, all prediction and gradients values, I^((k)), ∂I^((k))/∂x, ∂I^((k))/∂y, are calculated for positions inside the current block. FIG. 9A shows an example of access positions outside of a block 900. As shown in FIG. 9A, in Eq. (9), (2M+1)×(2M+1) square window SI centered in currently predicted point on a boundary of predicted block needs to accesses positions outside of the block. In the JEM, values of I^((k)), ∂I^((k))/∂x, ∂I^((k))/∂y outside of the block are set to be equal to the nearest available value inside the block. For example, this can be implemented as a padding area 901, as shown in FIG. 9B.

With BIO, it is possible that the motion field can be refined for each sample. To reduce the computational complexity, a block-based design of BIO is used in the JEM. The motion refinement can be calculated based on a 4×4 block. In the block-based BIO, the values of s_(n), in Eq. (9) of all samples in a 4×4 block can be aggregated, and then the aggregated values of s_(n), in are used to derived BIO motion vectors offset for the 4×4 block. More specifically, the following formula can used for block-based BIO derivation:

$\begin{matrix} {{s_{1,b_{k}} = {\sum\limits_{{({x,y})} \in b_{k}}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in {\Omega({x,y})}}\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)^{2}}}};} & {{Eq}.(12)} \end{matrix}$ ${s_{3,b_{k}} = {\sum\limits_{{({x,y})} \in b_{k}}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {I^{(1)} - I^{(0)}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)}}}};$ ${s_{2,b_{k}} = {\sum\limits_{{({x,y})} \in b_{k}}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {{\tau_{1}{\partial I^{(1)}}/{\partial x}} + {\tau_{0}{\partial I^{(0)}}/{\partial x}}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)}}}};$ ${s_{5,b_{k}} = {\sum\limits_{{({x,y})} \in b_{k}}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)^{2}}}};$ $s_{6,b_{k}} = {\sum\limits_{{({x,y})} \in b_{k}}{\sum\limits_{{\lbrack{i^{\prime},j}\rbrack} \in \Omega}{\left( {I^{(1)} - I^{(0)}} \right)\left( {{\tau_{1}{\partial I^{(1)}}/{\partial y}} + {\tau_{0}{\partial I^{(0)}}/{\partial y}}} \right)}}}$

Here, b_(k) denotes the set of samples belonging to the k-th 4×4 block of the predicted block. s_(n) in Eq (7) and Eq (8) are replaced by ((s_(n,bk))>>4) to derive the associated motion vector offsets.

In some scenarios, MV regiment of BIO may be unreliable due to noise or irregular motion. Therefore, in BIO, the magnitude of MV regiment is clipped to a threshold value. The threshold value is determined based on whether the reference pictures of the current picture are all from one direction. For example, if all the reference pictures of the current picture are from one direction, the value of the threshold is set to 12×2^(14−d); otherwise, it is set to 12×2^(13−d).

Gradients for BIO can be calculated at the same time with motion compensation interpolation using operations consistent with HEVC motion compensation process (e.g., 2D separable Finite Impulse Response (FIR)). In some embodiments, the input for the 2D separable FIR is the same reference frame sample as for motion compensation process and fractional position (fracX, fracY) according to the fractional part of block motion vector. For horizontal gradient ∂I/∂x, a signal is first interpolated vertically using BlOfilterS corresponding to the fractional position fracY with de-scaling shift d-8. Gradient filter BIOfilterG is then applied in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18-d. For vertical gradient ∂I/∂y, a gradient filter is applied vertically using BIOfilterG corresponding to the fractional position fracY with de-scaling shift d-8. The signal displacement is then performed using BlOfilterS in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18-d. The length of interpolation filter for gradients calculation BIOfilterG and signal displacement BIOfilterF can be shorter (e.g., 6-tap) in order to maintain reasonable complexity. Table 2 shows example filters that can be used for gradients calculation of different fractional positions of block motion vector in BIO. Table 3 shows example interpolation filters that can be used for prediction signal generation in BIO.

TABLE 2 Example filters for gradient calculation in BIO Fractional Interpolation filter pel position for gradient(BIOfilterG) 0 {  8, −39,  −3, 46, −17, 5} 1/16 {  8, −32, −13, 50, −18, 5} ⅛ {  7, −27, −20, 54, −19, 5} 3/16 {  6, −21, −29, 57, −18, 5} ¼ {  4, −17, −36, 60, −15, 4} 5/16 {  3,  −9, −44, 61, −15, 4} ⅜ {  1,  −4, −48, 61, −13, 3} 7/16 {  0,   1, −54, 60,  −9, 2} ½ { −1,   4, −57, 57,  −4, 1}

TABLE 3 Example interpolation filters for prediction signal generation in BIO Fractional Interpolation filter for prediction pel position signal(BIOfilterS) 0 { 0,  0, 64,  0,  0, 0} 1/16 { 1,  −3, 64,  4,  −2, 0} ⅛ { 1,  −6, 62,  9,  −3, 1} 3/16 { 2,  −8, 60, 14,  −5, 1} ¼ { 2,  −9, 57, 19,  −7, 2} 5/16 { 3, −10, 53, 24,  −8, 2} ⅜ { 3, −11, 50, 29,  −9, 2} 7/16 { 3, −11, 44, 35, −10, 3} ½ { 3, −10, 35, 44, −11, 3}

In the JEM, BIO can be applied to all bi-predicted blocks when the two predictions are from different reference pictures. When Local Illumination Compensation (LIC) is enabled for a CU, BIO can be disabled.

In some embodiments, OBMC is applied for a block after normal MC process. To reduce the computational complexity, BIO may not be applied during the OBMC process. This means that BIO is applied in the MC process for a block when using its own MV and is not applied in the MC process when the MV of a neighboring block is used during the OBMC process.

In JEM, BIO is only invoked for the luma component.

1.5 Examples of Frame-Rate Up Conversion (FRUC)

A FRUC flag can be signaled for a CU when its merge flag is true. When the FRUC flag is false, a merge index can be signaled, and the regular merge mode is used. When the FRUC flag is true, an additional FRUC mode flag can be signaled to indicate which method (e.g., bilateral matching or template matching) is to be used to derive motion information for the block.

At the encoder side, the decision on whether using FRUC merge mode for a CU is based on RD cost selection as done for normal merge candidate. For example, multiple matching modes (e.g., bilateral matching and template matching) are checked for a CU by using RD cost selection. The one leading to the minimal cost is further compared to other CU modes. If a FRUC matching mode is the most efficient one, FRUC flag is set to true for the CU and the related matching mode is used.

Typically, motion derivation process in FRUC merge mode has two steps: a CU-level motion search is first performed, then followed by a Sub-CU level motion refinement. At CU level, an initial motion vector is derived for the whole CU based on bilateral matching or template matching. First, a list of MV candidates is generated and the candidate that leads to the minimum matching cost is selected as the starting point for further CU level refinement. Then a local search based on bilateral matching or template matching around the starting point is performed. The MV results in the minimum matching cost is taken as the MV for the whole CU. Subsequently, the motion information is further refined at sub-CU level with the derived CU motion vectors as the starting points.

For example, the following derivation process is performed for a W×H CU motion information derivation. At the first stage, MV for the whole W×H CU is derived. At the second stage, the CU is further split into M×M sub-CUs. The value of M is calculated as in (16), D is a predefined splitting depth which is set to 3 by default in the JEM. Then the MV for each sub-CU is derived.

$\begin{matrix} {M = {\max\left\{ {4,{\min\left\{ {\frac{M}{2^{D}},\frac{N}{2^{D}}} \right\}}} \right\}}} & {{Eq}.(13)} \end{matrix}$

FIG. 10 shows an example of bilateral matching used in the Frame-Rate Up Conversion (FRUC) method. The bilateral matching is used to derive motion information of the current CU by finding the closest match between two blocks along the motion trajectory of the current CU (1000) in two different reference pictures (1010, 1011). Under the assumption of continuous motion trajectory, the motion vectors MV0 (1001) and MV1 (1002) pointing to the two reference blocks are proportional to the temporal distances, e.g., TD0 (1003) and TD1 (1004), between the current picture and the two reference pictures. In some embodiments, when the current picture 1000 is temporally between the two reference pictures (1010, 1011) and the temporal distance from the current picture to the two reference pictures is the same, the bilateral matching becomes mirror based bi-directional MV.

FIG. 11 shows an example of template matching used in the Frame-Rate Up Conversion (FRUC) method. Template matching can be used to derive motion information of the current CU 1100 by finding the closest match between a template (e.g., top and/or left neighboring blocks of the current CU) in the current picture and a block (e.g., same size to the template) in a reference picture 1110. Except the aforementioned FRUC merge mode, the template matching can also be applied to AMVP mode. In both JEM and HEVC, AMVP has two candidates. With the template matching method, a new candidate can be derived. If the newly derived candidate by template matching is different to the first existing AMVP candidate, it is inserted at the very beginning of the AMVP candidate list and then the list size is set to two (e.g., by removing the second existing AMVP candidate). When applied to AMVP mode, only CU level search is applied.

The MV candidate set at CU level can include the following: (1) original AMVP candidates if the current CU is in AMVP mode, (2) all merge candidates, (3) several MVs in the interpolated MV field (described later), and top and left neighboring motion vectors.

When using bilateral matching, each valid MV of a merge candidate can be used as an input to generate a MV pair with the assumption of bilateral matching. For example, one valid MV of a merge candidate is (MVa, ref_(a)) at reference list A. Then the reference picture ref_(b) of its paired bilateral MV is found in the other reference list B so that ref_(a) and ref_(b) are temporally at different sides of the current picture. If such a refb is not available in reference list B, ref_(b) is determined as a reference which is different from ref a and its temporal distance to the current picture is the minimal one in list B. After ref_(b) is determined, MVb is derived by scaling MVa based on the temporal distance between the current picture and ref_(a), ref_(b).

In some implementations, four MVs from the interpolated MV field can also be added to the CU level candidate list. More specifically, the interpolated MVs at the position (0, 0), (W/2, 0), (0, H/2) and (W/2, H/2) of the current CU are added. When FRUC is applied in AMVP mode, the original AMVP candidates are also added to CU level MV candidate set. In some implementations, at the CU level, 15 MVs for AMVP CUs and 13 MVs for merge CUs can be added to the candidate list.

The MV candidate set at sub-CU level includes an MV determined from a CU-level search, (2) top, left, top-left and top-right neighboring MVs, (3) scaled versions of collocated MVs from reference pictures, (4) one or more ATMVP candidates (e.g., up to four), and (5) one or more STMVP candidates (e.g., up to four). The scaled MVs from reference pictures are derived as follows. The reference pictures in both lists are traversed. The MVs at a collocated position of the sub-CU in a reference picture are scaled to the reference of the starting CU-level MV. ATMVP and STMVP candidates can be the four first ones. At the sub-CU level, one or more MVs (e.g., up to 17) are added to the candidate list.

Generation of an interpolated MV field. Before coding a frame, interpolated motion field is generated for the whole picture based on unilateral ME. Then the motion field may be used later as CU level or sub-CU level MV candidates.

In some embodiments, the motion field of each reference pictures in both reference lists is traversed at 4×4 block level. FIG. 12 shows an example of unilateral Motion Estimation (ME) 1200 in the FRUC method. For each 4×4 block, if the motion associated to the block passing through a 4×4 block in the current picture and the block has not been assigned any interpolated motion, the motion of the reference block is scaled to the current picture according to the temporal distance TD0 and TD1 (the same way as that of MV scaling of TMVP in HEVC) and the scaled motion is assigned to the block in the current frame. If no scaled MV is assigned to a 4×4 block, the block's motion is marked as unavailable in the interpolated motion field.

Interpolation and matching cost. When a motion vector points to a fractional sample position, motion compensated interpolation is needed. To reduce complexity, bi-linear interpolation instead of regular 8-tap HEVC interpolation can be used for both bilateral matching and template matching.

The calculation of matching cost is a bit different at different steps. When selecting the candidate from the candidate set at the CU level, the matching cost can be the absolute sum difference (SAD) of bilateral matching or template matching. After the starting MV is determined, the matching cost C of bilateral matching at sub-CU level search is calculated as follows:

C=SAD+w ·(|MV _(x) −MV _(x) ^(s) |+|MV _(y) −MV _(y) ^(s)|)   Eq. (14)

Here, w is a weighting factor. In some embodiments, w can be empirically set to 4. MV and MV^(s) indicate the current MV and the starting MV, respectively. SAD may still be used as the matching cost of template matching at sub-CU level search.

In FRUC mode, MV is derived by using luma samples only. The derived motion will be used for both luma and chroma for MC inter prediction. After MV is decided, final MC is performed using 8-taps interpolation filter for luma and 4-taps interpolation filter for chroma.

MV refinement is a pattern based MV search with the criterion of bilateral matching cost or template matching cost. In the JEM, two search patterns are supported—an unrestricted center-biased diamond search (UCBDS) and an adaptive cross search for MV refinement at the CU level and sub-CU level, respectively. For both CU and sub-CU level MV refinement, the MV is directly searched at quarter luma sample MV accuracy, and this is followed by one-eighth luma sample MV refinement. The search range of MV refinement for the CU and sub-CU step are set equal to 8 luma samples.

In the bilateral matching merge mode, bi-prediction is applied because the motion information of a CU is derived based on the closest match between two blocks along the motion trajectory of the current CU in two different reference pictures. In the template matching merge mode, the encoder can choose among uni-prediction from list0, uni-prediction from list1, or bi-prediction for a CU. The selection ca be based on a template matching cost as follows:

If costBi <= factor * min (cost0, cost1)   bi-prediction is used;  Otherwise, if cost0 <= cost1   uni-prediction from list0 is used;  Otherwise,   uni-prediction from list1 is used;

Here, cost0 is the SAD of list0 template matching, cost1 is the SAD of list1 template matching and costBi is the SAD of bi-prediction template matching. For example, when the value of factor is equal to 1.25, it means that the selection process is biased toward bi-prediction. The inter prediction direction selection can be applied to the CU-level template matching process.

1.6 Examples of MV Derived for MC in Chroma Components

In an example, the HEVC standard defines how to derive the MV used for MC in chroma components (noted as mvC) from the MV used for MC in the luma component (noted as my). Generally speaking, mvC is calculated as my multiplying a factor, which relies on the color format, such as 4:2:0 or 4:2:2.

1.7 Examples of Current Picture Referencing in VVC

Intra block copy (IBC, or intra picture block compensation), also named current picture referencing (CPR) was adopted in HEVC screen content coding extensions (SCC). This tool is very efficient for coding of screen content video in that repeated patterns in text and graphics rich content occur frequently within the same picture. Having a previously reconstructed block with equal or similar pattern as a predictor can effectively reduce the prediction error and therefore improve coding efficiency.

Similar to the design of CRP in HEVC SCC, In VVC, The use of the IBC mode is signaled at both sequence and picture level. When the IBC mode is enabled at sequence parameter set (SPS), it can be enabled at picture level. When the IBC mode is enabled at picture level, the current reconstructed picture is treated as a reference picture. Therefore, no syntax change on block level is needed on top of the existing VVC inter mode to signal the use of the IBC mode.

Features of this embodiment include:

-   -   It is treated as a normal inter mode. Therefore, merge and skip         modes are also available for the IBC mode. The merge candidate         list construction is unified, containing merge candidates from         the neighboring positions that are either coded in the IBC mode         or the HEVC inter mode. Depending on the selected merge index,         the current block under merge or skip mode can merge into either         an IBC mode coded neighbor or otherwise a normal inter mode         coded one with different pictures as reference pictures.     -   Block vector prediction and coding schemes for the IBC mode         reuse the schemes used for motion vector prediction and coding         in the HEVC inter mode (AMVP and MVD coding).     -   The motion vector for the IBC mode, also referred as block         vector, is coded with integer-pel precision, but stored in         memory in 1/16-pel precision after decoding as quarter-pel         precision is required in interpolation and deblocking stages.         When used in motion vector prediction for the IBC mode, the         stored vector predictor will be right shifted by 4.     -   Search range: it is restricted to be within the current CTU.     -   CPR is disallowed when affine mode/triangular mode/GBI/weighted         prediction is enabled.

1.8 Examples of Pairwise Average Candidates

Pairwise average candidates are generated by averaging predefined pairs of candidates in the current merge candidate list, and the predefined pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (2, 3)}, where the numbers denote the merge indices to the merge candidate list. The averaged motion vectors are calculated separately for each reference list. If both motion vectors are available in one list, these two motion vectors are averaged even when they point to different reference pictures; if only one motion vector is available, use the one directly; if no motion vector is available, keep this list invalid. The pairwise average candidates replace the combined candidates in HEVC standard. Suppose the MVs of two merge candidates are MV0=(MV0 x, MV0 y) and MV1=(MV1 x, MV1 y), then the MV of the pairwise merge candidate denoted as MV*=(MV*x, MV*y) is derived as

MV*x=(MV0x+MV1x)/2, and

MV*y=(MV0y+MV1y)/2.

In addition, when MV0 and MV1 refer to the current picture (i.e., CPR mode), MV*x and MV*y are further rounded to remove the part with a higher precision than full pixel to make sure the integer MV is obtained:

MV*x=(MV*x/16)<<4, and

MV*y=(MV*y/16)<<4.

It is noted that for each pair, if one of the two is coded with CPR and the other is not, such pair is disallowed to generate the pairwise average candidate.

1.9 Examples of Triangular Prediction Mode

The concept of the triangular prediction mode (TPM) is to introduce a new triangular partition for motion compensated prediction. It splits a CU into two triangular prediction units, in either diagonal or inverse diagonal direction. Each triangular prediction unit in the CU is inter-predicted using its own uni-prediction motion vector and reference frame index which are derived from a single uni-prediction candidate list. An adaptive weighting process is performed to the diagonal edge after predicting the triangular prediction units. Then, the transform and quantization process are applied to the whole CU. It is noted that this mode is only applied to merge mode (note: skip mode is treated as a special merge mode). Uni-prediction candidate list for TPM.

The uni-prediction candidate list, named TPM motion candidate list, consists of five uni-prediction motion vector candidates. It is derived from seven neighboring blocks including five spatial neighboring blocks and two temporal co-located blocks. The motion vectors of the seven neighboring blocks are collected and put into the uni-prediction candidate list according in the order of uni-prediction motion vectors, L0 motion vector of bi-prediction motion vectors, L1 motion vector of bi-prediction motion vectors, and averaged motion vector of the L0 and L1 motion vectors of bi-prediction motion vectors. If the number of candidates is less than five, zero motion vector is added to the list. Motion candidates added in this list for TPM are called TPM candidates, motion information derived from spatial/temporal blocks are called regular motion candidates.

More specifically, the following steps are involved:

-   -   (1) Obtain regular motion candidates from A1, B1, B0, A0, B2,         Col1 and Col2 (similar as those in the regular merge mode)         without any pruning operations.     -   (2) Set variable numCurrMergeCand=0     -   (3) For each regular motion candidates derived from A1, B1, B0,         A0, B2, Col1 and Col2 and numCurrMergeCand is less than 5, if         the regular motion candidate is uni-prediction (either from List         0 or List 1), it is directly added to the merge list as an TPM         candidate with numCurrMergeCand increased by 1. Such a TPM         candidate is named “originally uni -predicted candidate”.     -   Full pruning is applied.     -   (4) For each motion candidates derived from A1, B1, B0, A0, B2,         Col1 and Col2 and numCurrMergeCand is less than 5, if the         regular motion candidate is bi-prediction, the motion         information from List 0 is added to the TPM merge list (that is,         modified to be uni-prediction from List 0) as a new TPM         candidate and numCurrMergeCand increased by 1. Such a TPM         candidate is named ‘Truncated List0-predicted candidate’.     -   Full pruning is applied.     -   (5) For each motion candidates derived from A1, B1, B0, A0, B2,         Col1 and Col2 and numCurrMergeCand is less than 5, if the         regular motion candidate is bi-prediction, the motion         information from List 1 is added to the TPM merge list (that is,         modified to be uni-prediction from List 1) and numCurrMergeCand         increased by 1. Such a TPM candidate is named ‘Truncated         List1—predicted candidate’.     -   Full pruning is applied.     -   (6) For each motion candidates derived from A1, B1, B0, A0, B2,         Col1 and Col2 and numCurrMergeCand is less than 5, if the         regular motion candidate is bi-prediction, the motion         information of List 1 is firstly scaled to List 0 reference         picture, and the average of the two MVs (one is from original         List 0, and the other is the scaled MV from List 1) is added to         the TPM merge list, such a candidate is called averaged         uni-prediction from List 0 motion candidate and numCurrMergeCand         increased by 1.     -   Full pruning is applied.     -   (7) If numCurrMergeCand is less than 5, zero motion vector         candidates are added.

When inserting a candidate to the list, if it has to be compared to all previously added candidates to see whether it is identical to one of them, such a process is called full pruning.

Assume the scaled MV denoted by (MV1′x, MV1′y) and the List 0 MV by (MV0 x, MV0 y). The averaged uni-prediction from List 0 motion candidate denoted by (MV*x, MV*y) is defined as:

MV*x=(MV0x+MV1′x+1)>>1, and

MV*y=(MV0y+MV1′y+1)>>1.

2 Drawbacks of Existing Implementations

The existing sub-block based prediction technologies have the following problems:

-   -   (1) In some existing implementations, the size of sub-blocks         (such as 4×4 in JEM) is majorly designed for the luma component.         In JEM, the size of sub-blocks for is 2×2 the chroma components         with the 4:2:0 format, and 2×4 the chroma components with the         4:2:2 format. The small size of sub-blocks imposes a higher         band-width requirement. FIG. 13 shows an example of sub-blocks         of a 16×16 block (8×8 for Cb/Cr) for different components with         the 4:2:0 format in JEM.     -   (2) In some existing sub-block based tools such as the affine         prediction in JEM, MVs of each sub-block are calculated with the         affine model as shown in equation (1) independently for each         component, which results in misalignment of motion vectors         between luma and chroma components.     -   (3) In some existing sub-block based tools such as affine         prediction, the usage constrains are different for the merge         mode and the non-merge inter mode (a.k.a. AMVP mode, or normal         inter-mode), which need to be unified.     -   (4) In some existing implementations, the motion vector         averaging operation to derive the pairwise merge         candidate/averaged uni-prediction from List 0 motion candidate         should be aligned with the rounding method used in the sub-block         prediction. So, the hardware can have a unified design.

3 Exemplary Methods for Unified Rounding in Video Coding

Example 1. One block is divided into sub-blocks in different ways depending on the color component and/or the color format and/or block shape/size.

-   -   (a) For one luma and its corresponding chroma blocks (e.g., for         4:2:0 color format, one M×N luma block corresponds to one         M/2×N/2 Cb block and one M/2×N/2 Cr block), the number of         divided sub-blocks may be different for different components.         The block is divided into more sub-blocks for a component if the         block has a larger size for the component.     -   (b) For each color component, the size of sub-blocks is the         same, e.g., wxh for Y, Cb and Cr component, where wxh can be         8×8, 8×4, 4×8, 4×4, etc. For example, w and h are both equal         to 4. FIG. 14 shows an example of proposed sub-blocks of a 16×16         block (8×8 for Cb/Cr) for different components with the 4:2:0         format. In one example, if w>W or h>H, the block is not divided         into sub-blocks for the component.     -   (c) Different sizes of sub-block within one block may be         allowed. In one example, if W (or H) is not an integer multiple         of w (or h), it is proposed to merge the sub-blocks with         width/height smaller than wlh into its adjacent left or above         sub-block. FIG. 15 shows an example, where the 12×16 block (6×8         for Cb/Cr) is divided into sub-blocks. The sub-block size is         4×4. For Cb/Cr components, the size of last two sub-blocks is         2×4, so they are merged to their left neighboring blocks.     -   (d) Sub-block sizes may further depend on the block shape.         -   (i) In one example, for square blocks (with W equal to H), w             may be set equal to h.         -   (ii) Alternatively, for non-square blocks (with W unequal to             H), w may be unequal to h. For example, when W>H, w may be             set larger than h, and versa vice.     -   (e) Sub-block sizes of different color components or different         block shapes may be signaled in sequence parameter set (SPS),         picture parameter set (PPS), slice header.     -   (f) Sub-block sizes of Y component and Cb/Cr components may be         determined in different ways. For example, the sub-block size of         Y component is adaptively determined from some candidates such         as 4×4 8×8 4×8 and 8×4 but the sub-block size of Cb/Cr         components are fixed to be 4×4.     -   (g) Sub-block sizes of Y component and Cb/Cr components may         depend on the color formats, such as 4:2:0, 4:2:2 and 4:4:4.

Example 2. The MV of a sub-block of one color component can be derived from the MV(s) of one or more sub-blocks of another color component, which has (have) already been derived with the affine model. In this case, there is no need to derive motion information of one color component based on the information of the same color component three times.

-   -   (a) In one example, the MV of a sub-block for one component can         be derived from the MV of one corresponding sub-block for         another component. FIG. 16 shows an example for the 4:2:0         format. The blocks for each component are divided following the         example in FIG. 13 . A first derived MV* is copied from the MV         of a corresponding 4×4 sub-block in the Y component, then the MV         of the 2×2 sub-block in the Cb or Cr component is derived from         MV*, following the rule specified in Section 1.6.     -   (b) In another example, the MV of a sub-block for one component         can be derived from the MVs of several corresponding sub-blocks         for another component. FIG. 17 shows an example for the 4:2:0         format, where the 4×4 sub-block in the Cb or Cr component         corresponds to four 4×4 sub-block in the Y component. The blocks         for each component are divided following the example in FIG. 14         . A first derived MV* is calculated from the MVs of several         corresponding sub-blocks for another component, then the MV of         the 4×4 sub-block in the Cb or Cr component is derived from MV*,         following the rule specified in Section 1.6.         -   (i) In one embodiment, MV* is calculated as the average of             all corresponding sub-block MVs in the Y component. In an             example, MV*=(MV0+MV1+MV2 +MV3)/4. Suppose MV*=(MV*x, MV*y),             MV0=(MV0 x, MV0 y), MV1=(MV1 x, MV1 y), MV2=(MV2 x, MV2 y)             and MV3=(MV3 x, MV3 y),             -   (1) In one embodiment, MV*x=Shift(MV0 x+MV1 x+MV2 x+MV3                 x, 2), MV*y=Shift(MV0 y+MV1 y+MV2 y+MV3 y, 2).             -   (2) In another embodiment, MVx*=SignShift(MV0 x+MV1                 x+MV2 x+MV3 x, 2), MVy*=SignShift(MV0 y+MV1 y+MV2 y+MV3                 y, 2).             -   (3) In another embodiment, the calculation of MV* may be                 done with the following steps in order:

MV′x=Shift(MV0x+MV1x, 1),

MV′y=Shift(MV0y+MV1y, 1),

MV″x=Shift(MV2x+MV3x, 1),

MV″y=Shift(MV2y+MV3y, 1),

MV*x=Shift(MV′x+MV″x, 1), and

MV*y=Shift(MV′y+MV″y, 1).

-   -   (4) In another embodiment, the calculation of MV* may be done         with the following steps in order:

MV′x=Shift(MV0x+MV2x, 1),

MV′y=Shift(MV0y+MV2y, 1),

MV″x=Shift(MV1x+MV3x, 1),

MV″y=Shift(MV1y+MV3y, 1),

MV*x=Shift(MV′x+MV″x, 1), and

MV*y=Shift(MV′y+MV″y, 1).

-   -   (5) In another embodiment, the calculation of MV* may be done         with the following steps in order:

MV′x=SignShift(MV0x+MV1x, 1),

MV′y=SignShift(MV0y+MV1y, 1),

MV″x=SignShift(MV2x+MV3x, 1),

MV″y=SignShift(MV2y+MV3y, 1),

MV*x=SignShift(MV′x+MV″x, 1), and

MV*y=SignShift(MV′y+MV″y, 1).

-   -   (6) In another embodiment, the calculation of MV* may be done         with the following steps in order:

MV′x=SignShift(MV0x+MV2x, 1),

MV′y=SignShift(MV0y+MV2y, 1),

MV″x =SignShift(MV1x+MV3x, 1),

MV″y=SignShift(MV1y+MV3y, 1),

MV*x=SignShift(MV′x+MV″x, 1), and

MV*y=SignShift(MV′y+MV″y, 1).

-   -   (ii) In one embodiment, MV* is calculated as the MV of top-left         corresponding sub-block in the Y component. In the example,         MV*=MV0.     -   (iii) In one embodiment, MV* is calculated as the MV of center         corresponding sub-block in the Y component.     -   (iv) In one embodiment, MV* is calculated as the median of all         corresponding sub-block MVs in the Y component. In an example,         MV* =median(MV0,MV1,MV2,MV3).     -   (v) How to derive MVs of sub-blocks for one component from         another component may be determined based on the color formats,         such as 4:2:0, 4:2:2 and 4:4:4.         -   (1) In an example when the color format is 4:4:4, the             sub-block sizes are the same for all components, and the MV             of a sub-block for each sub-block is the same.         -   (2) In an example when the color format is 4:2:2. the             sub-block sizes are the same for all components. A first             derived MV* is calculated from the MVs of several             corresponding sub-blocks for another component, then the MV             of the sub-block in the Cb or Cr component is derived from             MV*, following the rule specified in section 2.6. In the             example shown in FIG. 18 , one Cb/Cr sub-block corresponds             to two Y sub-block with motion vectors MV0 and MV1.     -   (a) MV*=(MV0+MV1)/2; Suppose MV*=(MV*x, MV*y), MV0=(MV0 x, MV0         y), MV1=(MV1 x, MV1 y),         -   (i) In one embodiment, MV*x=Shift(MV0 x+MV1 x, 1),             MV*y=Shift(MV0 y+MV1 y, 1).         -   (ii) In another embodiment, MVx*=SignShift(MV0 x+MV1 x, 1),             MVy*=SignShift(MV0 y+MV1 y, 1).

Examples of Unified Constraints for Merge and Non-Merge Affine Modes

Example 3. The merge affine mode and the non-merge affine mode are allowed or disallowed with the same block size constraint.

-   -   (a) The block size constrain depends on the width and height         compared to one or two thresholds. For example, both the Merge         affine mode and the non-merge affine mode are allowed if the         width and the height of the current block are both larger than M         (e.g., M equal to 8), or width is larger than M0 and height is         larger than M1 (e.g., MO equal to 8 and M1 equal to 4);         Otherwise, both the Merge affine mode and the non-merge affine         mode are not allowed.     -   (b) The block size constrain depends on the total number of         samples within one block (i.e., the area width x height). In one         example, both the Merge affine mode and the non-merge affine         mode are allowed if the area (i.e. width×height) of the current         block is not smaller than N (e.g., N equal to 64); Otherwise,         both the Merge affine mode and the non-merge affine mode are not         allowed.     -   (c) For the merge affine mode, it can be an explicit mode with         signaling a flag as in JEM, or it can be an implicit mode         without signaling a flag as in other implementations. In the         latter case, the affine merge candidate is not put into the         unified merge candidate list if the merge affine mode is not         allowed.     -   (d) For the non-merge affine mode, when affine is disallowed         according to above rules, the signaling of indications of affine         mode is skipped.

Examples of the Unified Rounding Process

Example 4. Suppose one merge candidate has a motion vector denoted by MV0=(MV0 x, MV0 y) and another merge candidate has a motion vector denoted by MV1=(MV1 x, MV1 y), then one MV of the pairwise merge candidate derived from these two merge candidates, denoted as MV*=(MV*x, MV*y), is derived as

MV*x=Shift(MV0x+MV1x, 1), and

MV*y=Shift(MV0y+MV1y, 1).

Alternatively,

MV*x=SignShift(MV0x+MV1x, 1), and

MV*y=SignShift(MV0y+MV1y, 1).

Example 5. Suppose one merge candidate has a motion vector denoted by MV0=(MV0 x, MV0 y) and another merge candidate has a motion vector denoted by MV1=(MV1 x, MV1 y), and MV0 and/or MV1 refer to the current picture, then one MV of the pairwise merge candidate derived from these two merge candidates, denoted as MV*=(MV*x, MV*y), is derived as

-   -   (a) MV*x=Shift(MV0 x+MV1 x, 1); MV*y=Shift(MV0 y+MV1 y, 1); then         MV*x=(Shift(MV*x, 4))<<4; MV*y=(Shift(MV*y, 4))<< 4     -   (b) MV*x=SignShift(MV0 x+MV1 x, 1); MV*y=SignShift (MV0 y+MV1 y,         1); then MV*x=(SignShift (MV*x, 4))<<4; MV*y=(SignShift (MV*y,         4))<<4     -   (c) MV*x=(Shift(MV0x+MV1 x, (W+1)))<<W; MV*y=(Shift(MV0 y+MV1 y,         (W+1)))<<W, where W is an integer such as 2 or 4. W is an         integer so that 1<<W is equal to the MV representation         precision.     -   (d) MV*x=(SignShift(MV0 x+MV1 x, (W+1)))<<W; MV*y=(SignShift(MV0         y+MV1 y, (W+1))) <<W, where W is an integer such as 2 or 4. W is         an integer so that 1<<W is equal to the MV representation         precision.

Example 6. Assume the scaled MV denoted by (MV1′x, MV1′y) and the List 0 MV by (MV0 x, MV0 y). The averaged uni-prediction from List 0 motion candidate denoted by (MV*x, MV*y) is defined as:

MV*x=Shift(MV0x+MV1′x, 1), and

MV*y=Shift(MV0y+MV1′y, 1).

Alternatively,

MV*x=SignShift(MV0x+MV1′x, 1), and

MV*y=SignShift(MV0y+MV1′y, 1).

In some embodiments, SignShift(x, s) can right shift an integer toward 0,defined as:

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ \left. {{{- \left( \left( {{- x} + {off}} \right) \right.}}s} \right) & {x < 0} \end{matrix}.} \right.$

Herein, off=(1<<(s−1))−1.

In other embodiments, SignShift(x, s) can be alternatively defined as:

${{SignShift}\left( {x,s} \right)} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ {{\left( {x + {off} + 1} \right)}s} & {x < 0} \end{matrix}.} \right.$

Herein, off=(1<<(s−1))−1.

The examples described above may be incorporated in the context of the methods described below, e.g., methods 1930, 1960 and 1990 which may be implemented at a video decoder and/or video encoder.

FIG. 19A shows a flowchart of an exemplary method 1930 of video processing. The method 1930 includes, at step 1932, generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates.

The method 1930 includes, at step 1934, performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video.

FIG. 19B shows a flowchart of an exemplary method 1960 of video processing. The method 1960 includes, at step 1962, generating, for a processing of a current block of video, a pairwise merge candidate, the generating being based on a pair of motion candidates that refers to a current picture comprising the current block.

The method 1960 includes, at step 1964, performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video.

FIG. 19C shows a flowchart of an exemplary method 1990 of video processing. The method 1990 includes, at step 1992, generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a ListO motion vector.

The method 1990 includes, at step 1994, performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video.

In some embodiments, the following technical solutions are implemented:

A1. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=Shift(MV0x+MV1x, 1) and MV*y=Shift(MV0y+MV1y, 1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation. A2. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ \left. {{{- \left( \left( {{- x} + {off}} \right) \right.}}s} \right) & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. A3. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate based on a pair of motion candidates; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=MV*x, MV*y) is the pairwise merge candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ {{\left( {x + {off} + 1} \right)}s} & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. A4. The method of any of solutions A1 to A3, wherein the pair of merge candidates is from a merge candidate list. A5. The method of any of solutions A1 to A3, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1). A6. The method of any of solutions A1 to A3, further comprising: inserting the pairwise merge candidate into the merge candidate list. A7. The method of any of solutions A1 to A3, further comprising: updating, subsequent to performing the conversion, the merge candidate list. A8. The method of any of solutions A1 to A7, wherein off=0. A9. The method of any of solutions A1 to A7, wherein off=0 upon a determination that s=0. A10. The method of any of solutions A1 to A7, wherein off=1<<(s−1). A11. The method of any of solutions A1 to A7, wherein off=1>>(s−1) upon a determination that s≠0. A12. The method of any of solutions A1 to A7, wherein off=(1>>(s−1))−1. A13. The method of any of solutions A1 to A12, wherein the current video block is a coding unit. A14. The method of any of solutions A1 to A13, wherein performing the conversion comprises generating the bitstream representation from the current video block. A15. The method of any of solutions A1 to A13, wherein performing the conversion comprises generating the current video block from the bitstream representation. A16. A video decoding apparatus comprising a processor configured to implement a method recited in any one of solutions A1 to A15. A17. A computer program product stored on a non-transitory computer readable media, the computer program product including program code for carrying out the method in any one of solutions A1 to A15.

In some embodiments, the following technical solutions are implemented:

B1. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=Shift(MV0x+MV1x, 1) and MV*y=Shift(MV0y+MV1y, 1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation. B2. The method of solution B1, wherein generating the pairwise merge candidate further comprises performing the operations:

MV*x=(Shift(MV*x, 4))<<4 and MV*y=(Shift(MV*y, 4))<<4.

B3. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ \left. {{{- \left( \left( {{- x} + {off}} \right) \right.}}s} \right) & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. B4. The method of solution B3, wherein generating the pairwise merge candidate further comprises performing the operations:

MV*x=(SignShift(MV*x, 4))<<4 and MV*y=(SignShift(MV*y, 4))<<4.

B5. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ {{\left( {x + {off} + 1} \right)}s} & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. B6. The method of solution B5, wherein generating the pairwise merge candidate further comprises performing the operations:

MV*x=(SignShift(MV*x, 4))<<4 and MV*y=(SignShift(MV*y, 4))<<4.

B7. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=(Shift(MV0x+MV1x, (W+1)))<<W and

MV*y=(Shift(MV0y+MV1y,(W+1)))<<W,

wherein Shift(x, s)=(x+off)>>s , wherein W, off and s are integers, and wherein >> represents a right shift operation. B8. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=(SignShift(MV0x+MV1x,(W+1)))<<W and

${{MV}^{*}y} = {\left( {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},\left( {W + 1} \right)} \right)} \right){{W,{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ \left. {{{- \left( \left( {{- x} + {off}} \right) \right.}}s} \right) & {x < 0} \end{matrix},} \right.}}}}$

wherein W, off and s are integers, and wherein >> represents a shift operation. B9. A method of video processing, comprising: generating, for a processing of a current block of video, a pairwise merge candidate, wherein the generating is based on a pair of motion candidates that refers to a current picture comprising the current block; and performing, based on the pairwise merge candidate, a conversion between the current block and a bitstream representation of the video, wherein the pair of motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that:

MV*x=(SignShift(MV0x+MV1x,(W+1)))<<W and

${{MV}^{*}y} = {\left( {{SignShift}\left( {{{{MV}0y} + {{MV}1y}},\left( {W + 1} \right)} \right)} \right){{W,{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ {{\left( {x + {off} + 1} \right)}s} & {x < 0} \end{matrix},} \right.}}}}$

wherein W, off and s are integers, and wherein >> represents a shift operation. B10. The method of any of solutions B7 to B9, wherein W=2 or W=4. B11. The method of solution B10, wherein (1<<W) is a motion vector representation precision. B12. The method of any of solutions B1 to B11, wherein the pair of merge candidates is from a merge candidate list. B13. The method of any of solutions B1 to B11, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1). B14. The method of any of solutions B1 to B11, further comprising: inserting the pairwise merge candidate into the merge candidate list. B15. The method of any of solutions B1 to B11, further comprising: updating, subsequent to performing the conversion, the merge candidate list. B16. The method of any of solutions B1 to B15, wherein off=0. B17. The method of any of solutions B1 to B15, wherein off=0 upon a determination that s=0. B18. The method of any of solutions B1 to B15, wherein off=1<<(s−1). B19. The method of any of solutions B1 to B15, wherein off=1<<(s−1) upon a determination that s≠0. B20. The method of any of solutions B1 to B15, wherein off=(1<<(s−1))−1. B21. The method of any of solutions B1 to B20, wherein the current video block is a coding unit. B22. The method of any of solutions B1 to B21, wherein performing the conversion comprises generating the bitstream representation from the current block. B23. The method of any of solutions B1 to B21, wherein performing the conversion comprises generating the current block from the bitstream representation. B24. A video decoding apparatus comprising a processor configured to implement a method recited in any one of solutions B1 to B23. B25. A computer program product stored on a non-transitory computer readable media, the computer program product including program code for carrying out the method in any one of solutions B1 to B23.

In some embodiments, the following technical solutions are implemented:

C1. A method of video processing, comprising: generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a ListO motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the List0 motion vector is MV0=(MV0 x, MV0 y), and wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

MV*x=Shift(MV0x+MV1′x, 1) and MV*y=Shift(MV0y+MV1′y,1),

wherein Shift(x, s)=(x+off)>>s, wherein off and s are integers, and wherein >> represents a right shift operation. C2. A method of video processing, comprising: generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a List0 motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the List0 motion vector is MV0=(MV0 x, MV0 y), and wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1^{\prime}x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1^{\prime}y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ \left. {{{- \left( \left( {{- x} + {off}} \right) \right.}}s} \right) & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. C3. A method of video processing, comprising: generating, for a current block of video coded using a geometry partition mode, a uni-prediction motion candidate based on a scaled motion vector and a ListO motion vector; and performing, based on the uni-prediction motion candidate, a conversion between the current block and a bitstream representation of the video, wherein the scaled motion vector is MV1′=(MV1′x, MV1′y) and the ListO motion vector is MV0=(MV0 x, MV0 y), and wherein MV*=(MV*x, MV*y) is the uni-prediction motion candidate such that:

${{{MV}^{*}x} = {{{SignShift}\left( {{{{MV}0x} + {{MV}1^{\prime}x}},1} \right)}{and}}}{{{{MV}^{*}y} = {{SignShift}\left( {{{{MV}0y} + {{MV}1^{\prime}y}},1} \right)}},{{{wherein}{{SignShift}\left( {x,s} \right)}} = \left\{ {\begin{matrix} {{\left( {x + {off}} \right)}s} & {x \geq 0} \\ {{\left( {x + {off} + 1} \right)}s} & {x < 0} \end{matrix},} \right.}}$

wherein off and s are integers, and wherein >> represents a shift operation. C4. The method of any of claims 1 to 3, wherein MV* uses a reference picture from List0. C5. The method of any of solutions C1 to C3, wherein the scaled motion vector and the List0 motion vector are from a motion candidate list derived from blocks coded using the geometry partition mode. C6. The method of any of solutions C1 to C3, further comprising: inserting the uni-prediction motion candidate into the motion candidate list. C7. The method of any of solutions C1 to C3, further comprising: updating, subsequent to performing the conversion, the motion candidate list. C8. The method of any of solutions C1 to C7, wherein off=0. C9. The method of any of solutions C1 to C7, wherein off=0 upon a determination that s=0. C10. The method of any of solutions C1 to C7, wherein off=1>>(s−1). C11. The method of any of solutions C1 to C7, wherein off=1>>(s−1) upon a determination that s≠0. C12. The method of any of solutions C1 to C7, wherein off=(1<<(s−1))−1. C13. The method of any of solutions C1 to C12, wherein the geometry partition mode comprises a triangular prediction mode (TPM). C14. The method of any of solutions C1 to C12, wherein the current block is partitioned into multiple partitions with at least one partition being non-square and non-rectangular. C15. The method of any of solutions C1 to C14, wherein the current video block is a coding unit. C16. The method of any of solutions C1 to C15, wherein performing the conversion comprises generating the bitstream representation from the current video block. C17. The method of any of solutions Cl to C15, wherein performing the conversion comprises generating the current video block from the bitstream representation. C18. A video decoding apparatus comprising a processor configured to implement a method recited in any one of solutions C1 to C17. C19. A computer program product stored on a non-transitory computer readable media, the computer program product including program code for carrying out the method in any one of solutions C1 to C17.

4 Example Implementations of the Disclosed Technology

FIG. 20 is a block diagram of a video processing apparatus 2000. The apparatus 2000 may be used to implement one or more of the methods described herein. The apparatus 2000 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 2000 may include one or more processors 2002, one or more memories 2004 and video processing hardware 2006. The processor(s) 2002 may be configured to implement one or more methods (including, but not limited to, methods 1930, 1960 and 1990) described in the present disclosure. The memory (memories) 2004 may be used for storing data and code used for implementing the methods and techniques described herein. The video processing hardware 2006 may be used to implement, in hardware circuitry, some techniques described in the present disclosure.

In some embodiments, the video decoding methods may be implemented using an apparatus that is implemented on a hardware platform as described with respect to FIG. 20 .

FIG. 21 is a block diagram showing an example video processing system 2100 in which various techniques disclosed herein may be implemented. Various implementations may include some or all of the components of the system 2100. The system 2100 may include input 2102 for receiving video content. The video content may be received in a raw or uncompressed format, e.g., 8 or 10 bit multi-component pixel values, or may be in a compressed or encoded format. The input 2102 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as wireless fidelity (Wi-Fi) or cellular interfaces.

The system 2100 may include a coding component 2104 that may implement the various coding or encoding methods described in the present disclosure. The coding component 2104 may reduce the average bitrate of video from the input 2102 to the output of the coding component 2104 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 2104 may be either stored, or transmitted via a communication connected, as represented by the component 2106. The stored or communicated bitstream (or coded) representation of the video received at the input 2102 may be used by the component 2108 for generating pixel values or displayable video that is sent to a display interface 2110. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or Displayport, and so on. Examples of storage interfaces include serial advanced technology attachment (SATA), peripheral component interconnect (PCI), integrated drive electronics (IDE) interface, and the like. The techniques described in the present disclosure may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.

From the foregoing, it will be appreciated that specific embodiments of the presently disclosed technology have been described herein for purposes of illustration, but that various modifications may be made without deviating from the scope of the disclosure. Accordingly, the presently disclosed technology is not limited except as by the appended claims.

Implementations of the subject matter and the functional operations described in the present disclosure can be implemented in various systems, digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible and non-transitory computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them. The term “data processing unit” or “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC).

Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), and flash memory devices. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

It is intended that the specification, together with the drawings, be considered exemplary only, where exemplary means an example. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. Additionally, the use of “or” is intended to include “and/or”, unless the context clearly indicates otherwise.

While the present disclosure contains many specifics, these should not be construed as limitations on the scope of any embodiment or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular disclosures. Certain features that are described in the present disclosure in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in the present disclosure should not be understood as requiring such separation in all embodiments.

Only a few implementations and examples are described, and other implementations, enhancements and variations can be made based on what is described and illustrated in the present disclosure. 

What is claimed is:
 1. A method of coding video data, comprising: constructing, for a first block of a video, a merge motion candidate list which comprises at least two merge motion candidates; deriving, based on a position index to the merge motion candidate list and a first unified rounding process, a pairwise average merging candidate from a pair of merge motion candidates included in the merge motion candidate list; and performing, based on the pairwise average merging candidate, a conversion between the first block and a bitstream of the video, wherein the first unified rounding process is defined as: ${{SignShift}\left( {m,s} \right)} = \left\{ {\begin{matrix} {{\left( {m + {off}} \right)}s} & {m \geq 0} \\ \left. {{{- \left( \left( {{- m} + {off}} \right) \right.}}s} \right) & {m < 0} \end{matrix},} \right.$ wherein off and s are integers, and wherein >> represents a right shift operation.
 2. The method of claim 1, wherein the pair of merge motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first merge motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second merge motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that: MV*x=SignShift(MV0x+MV1x, s) and MV*y=SignShift(MV0y+MV1y, s).
 3. The method of claim 2, wherein position indices of the pair of merge motion candidates are fixed with 0 and 1
 4. The method of claim 2, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1).
 5. The method of claim 2, further comprising inserting the pairwise average merging candidate into the merge motion candidate list.
 6. The method of claim 2, wherein off=0.
 7. The method of claim 2, wherein s=1.
 8. The method of claim 1, wherein off=0 upon a determination that s=0.
 9. The method of claim 1, wherein off=(1>>(s−1))−1.
 10. The method of claim 1, wherein s=4.
 11. The method of claim 1, wherein the conversion comprises encoding the first block into the bitstream.
 12. The method of claim 1, wherein the conversion comprises decoding the first block from the bitstream.
 13. An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: construct, for a first block of a video, a merge motion candidate list which comprises at least two merge motion candidates; derive, based on a position index to the merge motion candidate list and a first unified rounding process, a pairwise average merging candidate from a pair of merge motion candidates included in the merge motion candidate list; and perform, based on the pairwise average merging candidate, a conversion between the first block and a bitstream of the video, wherein the first unified rounding process is defined as: ${{SignShift}\left( {m,s} \right)} = \left\{ {\begin{matrix} {{\left( {m + {off}} \right)}s} & {m \geq 0} \\ \left. {{{- \left( \left( {{- m} + {off}} \right) \right.}}s} \right) & {m < 0} \end{matrix},} \right.$ wherein off and s are integers, and wherein >> represents a right shift operation.
 14. The apparatus of claim 13, wherein the pair of merge motion candidates comprises a first motion vector MV0=(MV0x, MV0y) of a reference picture list L in a first merge motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second merge motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that: MV*x=SignShift(MV0x+MV1x,s) and MV*y=SignShift(MV0y+MV1y,s).
 15. The apparatus of claim 14, wherein position indices of the pair of merge motion candidates are fixed with 0 and 1, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1), wherein the instructions further cause the processor to insert the pairwise average merging candidate into the merge motion candidate list, wherein off=0, and wherein s=1.
 16. The apparatus of claim 13, wherein off=0 upon a determination that s=0, or off=(1<<(s−1))−1, and wherein s=4.
 17. A non-transitory computer-readable storage medium storing instructions that cause a processor to: construct, for a first block of a video, a merge motion candidate list which comprises at least two merge motion candidates; derive, based on a position index to the merge motion candidate list and a first unified rounding process, a pairwise average merging candidate from a pair of merge motion candidates included in the merge motion candidate list; and perform, based on the pairwise average merging candidate, a conversion between the first block and a bitstream of the video, wherein the first unified rounding process is defined as: ${{SignShift}\left( {m,s} \right)} = \left\{ {\begin{matrix} {{\left( {m + {off}} \right)}s} & {m \geq 0} \\ \left. {{{- \left( \left( {{- m} + {off}} \right) \right.}}s} \right) & {m < 0} \end{matrix},} \right.$ wherein off and s are integers, and wherein >> represents a right shift operation.
 18. The non-transitory computer-readable storage medium of claim 17, wherein the pair of merge motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first merge motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second merge motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that: MV*x=SignShift(MV0 x+MV1 x, s) and MV*y=SignShift(MV0 y+MV1 y, s), wherein the position indices of the pair of merge motion candidates are fixed with 0 and 1, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1), wherein the instructions further cause the processor to insert the pairwise average merging candidate into the merge motion candidate list, wherein off=0, or off=0 upon a determination that s=0, or off=(1<<(s−1))−1, and wherein s=1 or
 4. 19. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: constructing, for a first block of the video, a merge motion candidate list which comprises at least two merge motion candidates; deriving, based on a position index to the merge motion candidate list and a first unified rounding process, a pairwise average merging candidate from a pair of merge motion candidates included in the merge motion candidate list; and generating, based on the pairwise average merging candidate, the bitstream of the video; wherein the first unified rounding process is defined as: ${{SignShift}\left( {m,s} \right)} = \left\{ {\begin{matrix} {{\left( {m + {off}} \right)}s} & {m \geq 0} \\ \left. {{{- \left( \left( {{- m} + {off}} \right) \right.}}s} \right) & {m < 0} \end{matrix},} \right.$ wherein off and s are integers, and wherein >> represents a right shift operation.
 20. The non-transitory computer-readable recording medium of claim 19, wherein the pair of merge motion candidates comprises a first motion vector MV0=(MV0 x, MV0 y) of a reference picture list L in a first merge motion candidate and a second motion vector MV1=(MV1 x, MV1 y) of the reference picture list L in a second merge motion candidate, and wherein MV*=(MV*x, MV*y) is the pairwise merge candidate such that: MV*x=SignShift(MV0 x+MV1 x, s) and MV*y =SignShift(MV0 y+MV1 y, s), wherein the position indices of the pair of merge motion candidates are fixed with 0 and 1, wherein the reference picture list L comprises reference picture list 0 (L0) or reference picture list 1 (L1), wherein the method further includes inserting the pairwise average merging candidate into the merge motion candidate list, wherein off=0, or off=0 upon a determination that s=0, or off=(1<<(s−1))−1, and wherein s=1 or
 4. 